On tolerable and desirable behaviors in supervisory control of discrete event systems

We formulate and solve a new supervisory control problem for discrete event systems, The objective is to design a logical controller--or supervisor--such that the discrete event system satisfies a given set of requirements that involve event ordering, The controller must deal with a limited amount of controllability in the form of uncontrollable events. Our problem formulation considers that the requirements for the behavior (i.e., set of traces) of the controlled system are specified in terms of a "desired" behavior and a larger "tolerated" behavior. Due to the uncontrollabl, e events, one may wish to tolerate behavior that sometimes exceeds the ideal desired behavior if overall this results in achieving more of the desired behavior. The general solution of our problem is completely characterized. The nonblocking solution is also analyzed in detail. This solution requires the study of a new class of controllable languages. Several results are proved about this class of languages. Algorithms to compute certain languages of interest within this class are also presented. Key Vl,brds: discrete event systems, supervisory control, nonblocking controllers, controllable languages